Testing computability by width-two OBDDs
نویسندگان
چکیده
منابع مشابه
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object with that property. In this paper we give lower and upper bounds for testing functions for the property of being computable by a read-once width-2 Ordered Binary Decision Diagram (OBDD), also known as a branching program, wh...
متن کاملOn Testing Computability by Small Width OBDDs
We take another step in the study of the testability of small-width OBDDs, initiated by Ron and Tsur (Random’09). That is, we consider algorithms that, given oracle access to a function f : {0, 1}n → {0, 1}, need to determine whether f can be implemented by some restricted class of OBDDs or is far from any such function. Ron and Tsur showed that testing whether a function f : {0, 1}n → {0, 1} i...
متن کاملLower Bounds for Testing Computability by Small Width OBDDs
We consider the problem of testing whether a function f : {0, 1} → {0, 1} is computable by a read-once, width-2 ordered binary decision diagram (OBDD), also known as a branching program. This problem has two variants: one where the variables must occur in a fixed, known order, and one where the variables are allowed to occur in an arbitrary order. We show that for both variants, any nonadaptive...
متن کاملTesting Computability by Width-2 OBDDs Where the Variable Order is Unknown
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for a prespecified distance measure) from every object with that property. In this work we design and analyze an algorithm for testing functions for the property of being computable by a read-once width-2 Ordered Binary Decision Diagram (OBDD), also known as a branching...
متن کاملVery Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
We present several results on comparative complexity for different variants of OBDD models. – We present some results on comparative complexity of classical and quantum OBDDs. We consider a partial function depending on parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2 but any classical OBDD (deterministic or stable bounded error probabilistic) ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.007